منابع مشابه
The Axiom for Connected Sets
sists of the set of all ra such that EdneT. The Gödel number of Ed is, of course, d and the Gödel number of ra (i.e. of a string of l's of length w) is 2" —1. Thus A consists of all ra such that d * (2n— 1)G7V We add to (S2) : Axiom. PI —11. Production. Px — y—>Pxl — yy. P represents the set of all ordered pairs (i, j) such that 2'=j. Then we add: Production. Px — yl, Cd — y — z, Toz—^Qx. In th...
متن کاملThe univalence axiom in cubical sets
In this note we show that Voevodsky’s univalence axiom holds in the model of type theory based on cubical sets as described in [2, 6]. We will also discuss Swan’s construction of the identity type in this variation of cubical sets. This proves that we have a model of type theory supporting dependent products, dependent sums, univalent universes, and identity types with the usual judgmental equa...
متن کاملFuzzy Sets: Abstraction Axiom, Statistical Interpretation, Observations of Fuzzy Sets
The issues relating fuzzy sets definition are under consideration including the analogue for separation axiom, statistical interpretation and membership function representation by the conditional Probabilities.
متن کاملUncountable γ - sets under axiom CPA gamecube
In the paper we formulate a Covering Property Axiom CPA cube , which holds in the iterated perfect set model, and show that it implies the existence of uncountable strong γ-sets in R (which are strongly meager) as well as uncountable γ-sets in R which are not strongly meager. These sets must be of cardinality ω1 < c, since every γ-set is universally null, while CPA cube implies that every unive...
متن کاملConnected Dominating Sets
PROBLEM DEFINITION Consider a graph G = (V,E). A subset C of V is called a dominating set if every vertex is either in C or adjacent to a vertex in C. If, furthermore, the subgraph induced by C is connected, then C is called a connected dominating set. A connected dominating set with a minimum cardinality is called a minimum connected dominating set (MCDS). Computing a MCDS is an NP-hard proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1961
ISSN: 0002-9939
DOI: 10.2307/2034214